A combinatorial problem in finite fields. I
نویسندگان
چکیده
منابع مشابه
A combinatorial model for reversible rational maps over finite fields
We study time-reversal symmetry in dynamical systems with finite phase space, with applications to birational maps reduced over finite fields. For a polynomial automorphism with a single family of reversing symmetries, a universal (i.e. map-independent) distribution function R(x) = 1 − e−x(1 + x) has been conjectured to exist, for the normalized cycle lengths of the reduced map in the large fie...
متن کاملCombinatorial problems in finite fields and Sidon sets
We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solvability of some equations and the distribution of their solutions. We obtain classic and more recent results avoiding the use of exponential sums, the usual tool to deal with these problems.
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملThe Minimum Rank Problem over Finite Fields
Let Gk(F ) = {G | mr(F,G) ≤ k}, the set of simple graphs with minimum rank at most k. The problem of finding mr(F,G) and describing Gk(F ) has recently attracted considerable attention, particularly for the case in which F = R (see [Nyl96, CdV98, JD99, Hsi01, JS02, CHLW03, vdH03, BFH04, BvdHL04, HLR04, AHK05, BD05, BFH05a, BFH05b, BvdHL05, DK06, BF07]). The minimum rank problem over R is a sub-...
متن کاملDivisibility of polynomials over finite fields and combinatorial applications
Consider a maximum-length shift-register sequence generated by a primitive polynomial f over a finite field. The set of its subintervals is a linear code whose dual code is formed by all polynomials divisible by f . Since the minimum weight of dual codes is directly related to the strength of the corresponding orthogonal arrays, we can produce orthogonal arrays by studying divisibility of polyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1979
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1979.82.179